Extended Bezout Identities
نویسنده
چکیده
! $# , where # is the identity matrix. However, only two different types of primeness, ZLP and MLP, have been defined in [13], which correspond to the case % and a polynomial containing &(' % variables . To my knowledge, nothing has been done for the other cases until the work of Oberst [6], surely because the complexity of the matrices increases with the number & . The main contribution of [6] has been the introduction of algebraic analysis concepts [2] in the theory of multidimensional systems. Following an idea of Malgrange, it is shown in [6] how to associate with any multidimensional system a finitely presented module ) . Then, the author shows that ZLP (resp. MLP) corresponds to a projective (resp. torsion-free) -module ) and he defines a new type of primeness, WZLP, which corresponds to containing one variable. In [12], it is shown that for a multidimensional control system, defined by a full row rank matrices , there exist a one-to-one correspondence between the number of in and a chain of
منابع مشابه
On State-space Realization of Bezout Factorizations in Singular Systems
Based on reduced-order causal observer-based controllers for singular systems, a new state-space realization of Bezout factorization composed of all proper stable transfer functions is established. The resulting parametrization of all causal properly stabilizing controllers is characterized. The relationships among the Bezout factorization in the present paper and the previous results are also ...
متن کاملOn the resultant of degree-deficient polynomials
The resultant is an algebraic expression, computable in a finite number of arithmetic operations from the coefficients of two univariate polynomials, that vanishes if, and only if, the two polynomials have common zeros. The paper considers formal resultant for degree-deficient polynomials (polynomials whose actual degree is lower than their assumed degree). Some key properties of the resultant ...
متن کاملStructured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given Bezout matrix a new Bezout matrix of lower rank whose entries are near the corresponding entries of that input matrix. We present an algorithm based on a version of structured nonlinear total least squares (SNTLS) meth...
متن کاملBarnett's Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
This article provides a new presentation of Barnett’s theorems giving the degree (resp. coefficients) of the greatest common divisor of several univariate polynomials with coefficients in an integral domain by means of the rank (resp. linear dependencies of the columns) of several Bezout-like matrices. This new presentation uses Bezout or hybrid Bezout matrices instead of polynomials evaluated ...
متن کاملar X iv : m at h / 06 01 04 7 v 1 [ m at h . A G ] 3 J an 2 00 6 SEVERAL APPLICATIONS OF BEZOUT MATRICES
The notion of Bezout matrix is an essential tool in studying broad variety of subjects: zeroes of polynomials, stability of differential equations, rational transformations of algebraic curves, systems of commuting nonselfadjoint operators, boundaries of quadrature domains etc. We present a survey of several properties of Bezout matrices and their applications in all mentioned topics. We use th...
متن کامل